Cycle Saturation in Random Graphs
نویسندگان
چکیده
For a fixed graph F, the minimum number of edges in an edge-maximal F-free subgraph G is called F-saturation number. The asymptotics Erdos–Renyi random G(n, p) for constant \(p\in (0,1)\) was established any complete and star graph. We obtain \(C_m\)-saturation \(m\geqslant 5.\) Also we prove non-trivial linear (in n) lower bounds upper \(C_4\)-saturation some values p.
منابع مشابه
Saturation in random graphs
A graph H is Ks-saturated if it is a maximal Ks-free graph, i.e., H contains no clique on s vertices, but the addition of any missing edge creates one. The minimum number of edges in a Ks-saturated graph was determined over 50 years ago by Zykov and independently by Erdős, Hajnal and Moon. In this paper, we study the random analog of this problem: minimizing the number of edges in a maximal Ks-...
متن کاملOn the saturation number of graphs
Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...
متن کاملOn two Hamilton cycle problems in random graphs
We study two problems related to the existence of Hamilton cycles in random graphs. The first question relates to the number of edge disjoint Hamilton cycles that the random graph Gn,p contains. δ(G)/2 is an upper bound and we show that if p ≤ (1 + o(1)) lnn/n then this upper bound is tight whp. The second question relates to how many edges can be adversarially removed from Gn,p without destroy...
متن کاملSaturation Numbers in Tripartite Graphs
Given graphs H and F , a subgraph G ⊆ H is an F -saturated subgraph of H if F * G, but F ⊆ G + e for all e ∈ E(H) \ E(G). The saturation number of F in H, denoted sat(H,F ), is the minimum number of edges in an F -saturated subgraph of H. In this paper we study saturation numbers of tripartite graphs in tripartite graphs. For ` ≥ 1 and n1, n2, and n3 sufficiently large, we determine sat(Kn1,n2,...
متن کاملINTEGER-MAGIC SPECTRA OF CYCLE RELATED GRAPHS
For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trends in mathematics
سال: 2021
ISSN: ['2297-024X', '2297-0215']
DOI: https://doi.org/10.1007/978-3-030-83823-2_129